Geometric Optimisation Via Spectral Shifting

نویسندگان

چکیده

We present a geometric optimisation framework that can recover fold-over free maps from non-injective initial states using popular flip-preventing distortion energies. Since energies are infinite for folded configurations, we propose new regularisation scheme shifts the singular values of deformation gradient. This allow us to re-use many existing algorithms, especially locally injective methods initially maps. Our is suitable both value- and invariant-based formulations, systematically contributes multiple stabilisers Hessian. In contrast proxy-based techniques, maintain second-order convergence. Compact expressions energy eigensystems be obtained our extended stretch invariants, enabling use fast projected Newton solvers. Although spectral shifting in general has no theoretical guarantees global minimum an injection, extensive experiments show extremely robust practice, capable generating high-quality severely distorted, degenerate initialisations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Particle Swarm Optimisation

Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimization (PSO) and evolutionary algorithms. This connection enables us to generalize PSO to virtually any solution representation in a natural and straightforward way. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces.

متن کامل

Geometric Optimisation and FastICA Algorithms

Independent component analysis is a challenging problem in the area of unsupervised adaptive filtering. Recently, there has been an increasing interest in using geometric optimisation for adaptive filtering. The performance of ICA algorithms significantly depends on the choice of the contrast function and the optimisation algorithm used in obtaining the demixing matrix. In this paper we focus o...

متن کامل

Shifting Strategy for Geometric Graphs without Geometry

We give a simple framework as an alternative to the celebrated shifting strategy of Hochbaum and Maass [J. ACM, 1985] which has yielded efficient algorithms with good approximation bounds for numerous optimization problems in low-dimensional Euclidean space. Our framework does not require the input graph/metric to have a geometric realization – it only requires that the input graph satisfy some...

متن کامل

Geometric Spectral Partitioning

We investigate a new method for partitioning a graph into two equal-sized pieces with few connecting edges. We combine ideas from two recently suggested partitioning algorithms, spectral bisection (which uses an eigenvector of a matrix associated with the graph) and geometric bisection (which applies to graphs that are meshes in Euclidean space). The new method does not require geometric coordi...

متن کامل

Spectral analysis of phase shifting algorithms.

Systematic spectral analysis of Phase Shifting Interferometry (PSI) algorithms was first proposed in 1990 by Freischlad and Koliopoulos (F&K). This analysis was proposed with the intention that "in a glance" the main properties of the PSI algorithms would be highlighted. However a major drawback of the F&K spectral analysis is that it changes when the PSI algorithm is rotated or its reference s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ACM Transactions on Graphics

سال: 2023

ISSN: ['0730-0301', '1557-7368']

DOI: https://doi.org/10.1145/3585003